منابع مشابه
Topology coloring
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...
متن کاملBetween coloring and list-coloring: μ-coloring
A new variation of the coloring problem, μ-coloring, is defined in this paper. Given a graph G and a function μ, a μ-coloring is a coloring where each vertex v of G must receive a color at most μ(v). It is proved that μ-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. The notion of perfection is extended for μ-coloring, l...
متن کاملPhilosophy matters in brain matters
PURPOSE Although most neuroscientists and physicians would argue against Cartesian dualism, Descartes's version of the psyche/soma divide, which has been controversial since he proposed it in the seventeenth century, continues to haunt contemporary neurological diagnoses through terms such as functional, organic, and psychogenic. Drawing on my own experiences as a person with medically unexplai...
متن کاملMatters of sex: sex matters.
Despite the popular concept that heart disease preferentially affects the male population, in every year for the past 16 years, cardiovascular disease has killed more women than men.1 Unfortunately, a disparity still exists between men and women in the diagnosis and aggressive treatment of heart disease. The perception that women are relatively protected is reflected by the fact that women are ...
متن کاملSub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph G, we want to partition the vertices of G into minimum number of sub-color classes, where each sub-color clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1883
ISSN: 0036-8733
DOI: 10.1038/scientificamerican01271883-52